YES 0.723
↳ HASKELL
↳ BR
((foldFM_LE :: (() -> a -> b -> b) -> b -> () -> FiniteMap () a -> b) :: (() -> a -> b -> b) -> b -> () -> FiniteMap () a -> b) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||||||||||||
foldFM_LE :: Ord b => (b -> c -> a -> a) -> a -> b -> FiniteMap b c -> a
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((foldFM_LE :: (() -> b -> a -> a) -> a -> () -> FiniteMap () b -> a) :: (() -> b -> a -> a) -> a -> () -> FiniteMap () b -> a) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||||||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||||||||||||
foldFM_LE :: Ord a => (a -> c -> b -> b) -> b -> a -> FiniteMap a c -> b
|
import qualified FiniteMap import qualified Prelude |
foldFM_LE k z fr EmptyFM = z foldFM_LE k z fr (Branch key elt vw fm_l fm_r)
| key <= fr
= foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r | otherwise
= foldFM_LE k z fr fm_l
foldFM_LE k z fr EmptyFM = foldFM_LE3 k z fr EmptyFM foldFM_LE k z fr (Branch key elt vw fm_l fm_r) = foldFM_LE2 k z fr (Branch key elt vw fm_l fm_r)
foldFM_LE0 k z fr key elt vw fm_l fm_r True = foldFM_LE k z fr fm_l
foldFM_LE1 k z fr key elt vw fm_l fm_r True = foldFM_LE k (k key elt (foldFM_LE k z fr fm_l)) fr fm_r foldFM_LE1 k z fr key elt vw fm_l fm_r False = foldFM_LE0 k z fr key elt vw fm_l fm_r otherwise
foldFM_LE2 k z fr (Branch key elt vw fm_l fm_r) = foldFM_LE1 k z fr key elt vw fm_l fm_r (key <= fr)
foldFM_LE3 k z fr EmptyFM = z foldFM_LE3 wv ww wx wy = foldFM_LE2 wv ww wx wy
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(foldFM_LE :: (() -> a -> b -> b) -> b -> () -> FiniteMap () a -> b) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||
instance (Eq a, Eq b) => Eq (FiniteMap b a) where |
|||||||||
foldFM_LE :: Ord b => (b -> a -> c -> c) -> c -> b -> FiniteMap b a -> c
|
|||||||||
|
|||||||||
|
|||||||||
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ QDPSizeChangeProof
new_foldFM_LE(wz3, @0, Branch(@0, wz61, wz62, wz63, wz64), h, ba) → new_foldFM_LE(wz3, @0, wz64, h, ba)
new_foldFM_LE(wz3, @0, Branch(@0, wz61, wz62, wz63, wz64), h, ba) → new_foldFM_LE(wz3, @0, wz63, h, ba)
From the DPs we obtained the following set of size-change graphs: